On rearrangements of conditionally convergent series
نویسندگان
چکیده
منابع مشابه
The Descriptive Complexity of Series Rearrangements
We consider the descriptive complexity of some subsets of the infinite permutation group S∞ which arise naturally from the classical series rearrangement theorems of Riemann, Levy, and Steinitz. In particular, given some fixed conditionally convergent series of vectors in Euclidean space Rd, we study the set of permutations which make the series diverge, as well as the set of permutations which...
متن کاملA Distributional Approach to Conditionally Convergent Series
Whether the car’s gas tank is filled up on Monday and the paycheck is deposited on Tuesday, or vice versa, the contribution of those two transactions to the checkbook’s final balance is the same. By the commutative property, order does not matter for the algebraic addition of a finite number of terms. However, for a super banker who conducts an infinite number of transactions, order may matter....
متن کاملRearranging Series Constructively
Riemann’s theorems on the rearrangement of absolutely convergent and conditionally convergent series of real numbers are analysed within Bishop-style constructive mathematics. The constructive proof that every rearrangement of an absolutely convergent series has the same sum is relatively straightforward; but the proof that a conditionally convergent series can be rearranged to converge to what...
متن کاملComputing sums of conditionally convergent and divergent series using the concept of grossone
Let a1, a2, . . . be a numerical sequence. In this talk we consider the classical problem of computing the sum ∑∞ n=1 an when the series is either conditionally convergent or divergent. We demonstrate that the concept of grossone, proposed by Ya. Sergeyev in [1], can be useful in both computing this sum and studying properties of summation methods. First we prove that within the grossone univer...
متن کامل